Probabilistic Fair Queuing
نویسندگان
چکیده
Packet scheduling constitutes the core problem in efficient fair allocation of bandwidth to competing flows. To date, numerous algorithms for packet scheduling have been suggested and tested. However, only a few of them are currently deployed. One of the key reasons for rarity of applied packet scheduling methods lies in the complexity of their implementation. This paper describes a family of randomized algorithms for packet scheduling. These algorithms are simple to implement and require small amounts of computation time. Specifically, we present an O(1) probabilistic weighted fair queuing algorithm that emits packets from flows with an improved delay jitter. Experimental results of the proposed randomized algorithms suggest that the randomized approach is a viable alternative to the currently deployed deterministic fair queuing algorithms.
منابع مشابه
Randomized Caching, Probabilistic Queuing, and Denial of Service Attacks
We propose and analyze a randomized caching scheme in which an item is cached only with a certain probability. We use such caches to build a probabilistic queuing mechanism which can provide a fair share of resources to the users by discriminating them based on the frequency of requests. We demonstrate that denial of service attacks can be better sustained when this probabilistic queuing mechan...
متن کاملFair Stateless Aggregate Marking Techniques for Differentiated Services Networks
In heterogeneous networks such as today’s Internet, the differentiated services architecture for providing scalable service differentiation, has proved to be a practical and easily deployable method for providing Quality-of-Services. In this paper, we focus on the issue of packet marking in diffserv networks. We specifically look at developing fair aggregate markers which do not need to maintai...
متن کاملEnhanced core stateless fair queuing with multiple queue priority scheduler
The Core Stateless Fair Queuing (CSFQ) is a distributed approach of Fair Queuing (FQ). The limitations include its inability to estimate fairness during large traffic flows, which are short and bursty (VoIP or video), and also it utilizes the single FIFO queue at the core router. For improving the fairness and efficiency, we propose an Enhanced Core Stateless Fair Queuing (ECSFQ) with multiple ...
متن کاملStochastic Fairness Queuing
Fairness queuing has recently been proposed as an e ective way to insulate users of large computer communication datagram networks from congestion caused by the activities of other (possibly ill-behaved) users. Unfortunately, fair queuing as proposed by Shenker et al. [DKS89] requires that each conversationz be mapped into its own queue. While there are many known methods of implementing this t...
متن کاملSpeeding up the Convergence of Estimated Fair Share in Csfq
Core-stateless Fair Queueing (CSFQ) is a scheme to achieve approximate fair bandwidth sharing without perflow state in the interior routers. The extra packets that beyond the fair share for each flow are dropped probabilistically based on the attached flow rate in the packet header and the estimated fair share. A heuristic method is used to estimate the fair share in CSFQ. In our previous work ...
متن کامل